Path decomposition

Results: 318



#Item
11MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com A Complete and Effective Move Set for Simplified Protein Folding

MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com A Complete and Effective Move Set for Simplified Protein Folding

Add to Reading List

Source URL: www.eecs.harvard.edu

Language: English - Date: 2003-02-21 13:49:05
12Contemporary Mathematics  Graph Partitioning for Scalable Distributed Graph Computations Aydın Bulu¸c and Kamesh Madduri Abstract. Inter-node communication time constitutes a significant fraction

Contemporary Mathematics Graph Partitioning for Scalable Distributed Graph Computations Aydın Bulu¸c and Kamesh Madduri Abstract. Inter-node communication time constitutes a significant fraction

Add to Reading List

Source URL: gauss.cs.ucsb.edu

Language: English - Date: 2013-03-15 01:10:50
13A Constant Bound for the Periods of Parallel Chip-firing Games with Many Chips Paul Myer Kominers and Scott Duke Kominers Abstract. We prove that any parallel chip-firing game on a graph G with at least 4|E(G)| − |V (G

A Constant Bound for the Periods of Parallel Chip-firing Games with Many Chips Paul Myer Kominers and Scott Duke Kominers Abstract. We prove that any parallel chip-firing game on a graph G with at least 4|E(G)| − |V (G

Add to Reading List

Source URL: www.pkoms.com

Language: English - Date: 2011-12-29 23:15:14
14BRICS  Basic Research in Computer Science BRICS RSHangos et al.: Some Complexity Problems on Single Input Double Output Controllers  Some Complexity Problems on

BRICS Basic Research in Computer Science BRICS RSHangos et al.: Some Complexity Problems on Single Input Double Output Controllers Some Complexity Problems on

Add to Reading List

Source URL: www.brics.dk

Language: English - Date: 2001-05-28 05:33:34
15June 3, :International Journal of Neural Systems, Vol. 20, No–232 c World Scientific Publishing Company  DOI: S0129065710002383

June 3, :International Journal of Neural Systems, Vol. 20, No–232 c World Scientific Publishing Company  DOI: S0129065710002383

Add to Reading List

Source URL: www.ihes.fr

Language: English - Date: 2010-06-18 08:47:36
16KaHIP v0.71 – Karlsruhe High Quality Partitioning User Guide Peter Sanders and Christian Schulz Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany Email: {sanders, christian.schulz}@kit.edu

KaHIP v0.71 – Karlsruhe High Quality Partitioning User Guide Peter Sanders and Christian Schulz Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany Email: {sanders, christian.schulz}@kit.edu

Add to Reading List

Source URL: algo2.iti.kit.edu

Language: English - Date: 2015-01-03 02:07:55
17Vertex Separators and low tree-width k-coloring Lectures 11 and 12, January 12 and 19, A theorem about vertex separators

Vertex Separators and low tree-width k-coloring Lectures 11 and 12, January 12 and 19, A theorem about vertex separators

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2012-01-23 02:46:03
18Treewidth in Verification: Local vs. Global⋆ Andrea Ferrara1 , Guoqiang Pan2 , and Moshe Y. Vardi2 1 DIS - Universit`a di Roma ”La Sapienza” Via Salaria 113, 00198 Roma, Italy

Treewidth in Verification: Local vs. Global⋆ Andrea Ferrara1 , Guoqiang Pan2 , and Moshe Y. Vardi2 1 DIS - Universit`a di Roma ”La Sapienza” Via Salaria 113, 00198 Roma, Italy

Add to Reading List

Source URL: www.cs.rice.edu

Language: English - Date: 2005-09-30 15:47:37
19On Touching Triangle Graphs Emden R. Gansner1 , Yifan Hu1 , and Stephen G. Kobourov2 1 AT&T Labs - Research, Florham Park, NJ 2

On Touching Triangle Graphs Emden R. Gansner1 , Yifan Hu1 , and Stephen G. Kobourov2 1 AT&T Labs - Research, Florham Park, NJ 2

Add to Reading List

Source URL: www.research.att.com

Language: English - Date: 2011-04-23 00:00:02
20BRICS  Basic Research in Computer Science BRICS RSJ. M. Nielsen: On the Number of Maximal Independent Sets in a Graph  On the Number of Maximal Independent Sets

BRICS Basic Research in Computer Science BRICS RSJ. M. Nielsen: On the Number of Maximal Independent Sets in a Graph On the Number of Maximal Independent Sets

Add to Reading List

Source URL: www.brics.dk

Language: English - Date: 2002-04-12 04:11:55